Determinants of matrices related to the Pascal triangle

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matrices Related to the Pascal Triangle

for 0 ≤ i, j ∈ N. The matrix P is hence the famous Pascal triangle yielding the binomial coefficients and can be recursively constructed by the rules p0,i = pi,0 = 1 for i ≥ 0 and pi,j = pi−1,j + pi,j−1 for 1 ≤ i, j. In this paper we are interested in (sequences of determinants of finite) matrices related to P . The present section deals with some minors (determinants of submatrices) of the abo...

متن کامل

1 Matrices related to the Pascal triangle

for 0 ≤ i, j ∈ N. The matrix P is hence the famous Pascal triangle yielding the binomial coefficients and can be recursively constructed by the rules p0,i = pi,0 = 1 for i ≥ 0 and pi,j = pi−1,j + pi,j−1 for 1 ≤ i, j. In this paper we are interested in (sequences of determinants of finite) matrices related to P . The present section deals with determinants of some minors of the above Pascal tria...

متن کامل

Evaluations of Some Determinants of Matrices Related to the Pascal Triangle

We prove several evaluations of determinants of matrices, the entries of which are given by the recurrence ai,j = ai−1,j + ai,j−1, or variations thereof. These evaluations were either conjectured or extend conjectures by Roland Bacher [J. Théorie Nombres Bordeaux 14 (2002), to appear].

متن کامل

A Pascal-like Triangle Related to the Tribonacci Numbers

A tile composed of two pieces, which we refer to as a fence tile, is introduced to give the Tribonacci numbers a new combinatorial interpretation. The interpretation is used to construct a Pascal-like triangle and various identities concerning the triangle are proven. An intuitive proof of a general identity for the Tribonacci numbers in terms of sums of products of the binomial coefficients is...

متن کامل

Pascal Matrices

Every polynomial of degree n has n roots; every continuous function on [0, 1] attains its maximum; every real symmetric matrix has a complete set of orthonormal eigenvectors. “General theorems” are a big part of the mathematics we know. We can hardly resist the urge to generalize further! Remove hypotheses, make the theorem tighter and more difficult, include more functions, move into Hilbert s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal de Théorie des Nombres de Bordeaux

سال: 2002

ISSN: 1246-7405

DOI: 10.5802/jtnb.344